Efficient minimization of higher order submodular functions using monotonic Boolean functions
نویسندگان
چکیده
منابع مشابه
Efficient Minimization of Higher Order Submodular Functions using Monotonic Boolean Functions
Submodular function minimization is a key problem in a wide variety of applications in machine learning, economics, game theory, computer vision, and many others. The general solver has a complexity of O(n log n.E + nlogn) where E is the time required to evaluate the function and n is the number of variables [32]. On the other hand, many computer vision and machine learning problems are defined...
متن کاملEfficient Minimization of Decomposable Submodular Functions
Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of convex functions, and can be minimized in strongly polynomial time. Unfortunately, state-of-the-art algorithms for general submodular minimization are intractable for larger problems. In this paper, we introduce a novel ...
متن کاملMinimization of Boolean Functions
This thesis presents two new methods of test-per-clock BIST design for combinational circuits. One of them is based on a transformation of the PRPG code words into test patterns generated by an ATPG tool. This transformation is done by a combinational circuit. For a design of such a circuit two major tasks have to be solved: first, the proper matching between the PRPG code words and the test pa...
متن کاملBoolean Functions Satisfying Higher Order Propagation Criteria
Boolean functions that satisfy higher order propagation criteria are studied. A complete characterization is given of the autocorrelation function and Walsh spectrum of second order functions. The number of second order functions satisfying PC(k) is related to a problem in coding theory and can be computed explicitly for k = 1, n− 1 and n. A new interpretation of the number of balanced second o...
متن کاملSubmodular goal value of Boolean functions
Recently, Deshpande et al. introduced a new measure of the complexity of a Boolean function. We call this measure the “goal value” of the function. The goal value of f is defined in terms of a monotone, submodular utility function associated with f . As shown by Deshpande et al., proving that a Boolean function f has small goal value can lead to a good approximation algorithm for the Stochastic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.11.022